Asynchronous Memory Machine Models with Barrier Synchronization
نویسندگان
چکیده
منابع مشابه
Firefly Synchronization with Asynchronous Wake-up
This paper considers biologically-inspired synchronization algorithms for a model with primitive communication and asynchronous wake-up. Existing averaging-style algorithms for synchronization implicitly require a coherent round structure to guarantee convergence. We argue that this assumption is too strong in a distributed setting, and thus investigate the synchronization problem assuming node...
متن کاملBreaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with nε Memory per Machine
Recently, studying fundamental graph problems in the Massive Parallel Computation (MPC) framework, inspired by the MapReduce paradigm, has gained a lot of attention. A standard assumption, common to most traditional approaches, is to allow Ω̃(n) memory per machine, where n is the number of nodes in the graph and Ω̃ hides polylogarithmic factors. However, as pointed out by Karloff et al. [SODA’10]...
متن کاملAsynchronous Consensus with Bounded Memory
We present here a bounded memory consensus Obstruction-Free algorithm for the asynchronous shared memory model. More precisely for a set of n processes, this algorithm uses n + 1 multi-writer multi-reader (MWMR) registers, each of these registers being of size O(log(n)) bits. Then we get a O(n log(n))-bits size complexity consensus algorithm with single-writer multi-reader (SWMR) registers and ...
متن کاملMultitolerant Barrier Synchronization
We design a multitolerant program for synchronizing the phases of concurrent processes. The tolerances of the program enable processes to (i) execute all phases correctly in the presence of faults that corrupt process state in a detectable manner, and (ii) execute only a minimum possible number of phases incorrectly before resuming correct computation in the presence of faults that corrupt proc...
متن کاملBarrier Synchronization Pattern
Parallel algorithms divide the work into multiple, concurrent tasks. These tasks or UEs may execute in parallel depending on the physical resources available. It is common for UEs to proceed in phases where the next phase cannot start until all UEs complete the previous phase. This is typically due to mutual dependency on the data written during the previous phase by concurrent UEs. Since UEs m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2014
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e97.d.431